Prediksi Pengajuan Kredit Usaha Pada Koperasi Menggunakan Algoritma K-Nearest Neighbor
نویسندگان
چکیده
Cooperative activities have become the most needed by many people because they are related to money, cooperatives places that provide loans housewives and also workers in a certain area or environment, lack of interest offered this cooperative is considered very easy. helpful for parties facilitating financial affairs, especially matters, convenience makes interested ask same thing resulting vulnerability fraud, importance making predictions on prospective new business loan applications can help reduce worst risks from various occur future, study k-nearest neighbor algorithm will be used as prediction credit at cooperatives, value obtained training data records several previous customers so easier know test study. The results found "Not Eligible" seen closest based smallest with (closest distance) between one another 3 distances, namely numbers 1, 2 where number 1 states feasible ”, second distance stating “Eligible” “Not Eligible”, stated Not Eligible decision had rejected eligible” accepted
منابع مشابه
Sistem Informasi Pengarsipan Menggunakan Algoritma Levensthein String pada Kecamatan Seberang Ulu II
Archival information systems in government agency is one of the most used applications for daily acitivities. One feature in application management information document is searching. This feature serves to search for documents from a collection of available information based on keywords entered by the user. But some researches on a search engine (searching) concluded that the average user error...
متن کاملDrought Monitoring and Prediction using K-Nearest Neighbor Algorithm
Drought is a climate phenomenon which might occur in any climate condition and all regions on the earth. Effective drought management depends on the application of appropriate drought indices. Drought indices are variables which are used to detect and characterize drought conditions. In this study, it was tried to predict drought occurrence, based on the standard precipitation index (SPI), usin...
متن کاملFast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.
متن کاملUnsupervised K-Nearest Neighbor Regression
In many scientific disciplines structures in highdimensional data have to be found, e.g., in stellar spectra, in genome data, or in face recognition tasks. In this work we present a novel approach to non-linear dimensionality reduction. It is based on fitting K-nearest neighbor regression to the unsupervised regression framework for learning of low-dimensional manifolds. Similar to related appr...
متن کاملMultidimensi Pada Data Warehouse Dengan Menggunakan Rumus Kombinasi
Multidimensional in data warehouse is a compulsion and become the most important for information delivery, without multidimensional data warehouse is incomplete. Multidimensional give the able to analyze business measurement in many different ways. Multidimensional is also synonymous with online analytical processing (OLAP).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Building of Informatics, Technology and Science (BITS)
سال: 2022
ISSN: ['2684-8910', '2685-3310']
DOI: https://doi.org/10.47065/bits.v4i1.1626